Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
نویسندگان
چکیده
We show interreducibility under (Turing) reductions of low polynomial degree between three families of problems parametrised by classes of formal languages: the problem of reachability in a directed graph constrained by a formal language, the problem of deciding whether or not the intersection of a language of some class with a regular language is empty, and the model checking problem for Propositional Dynamic Logic over some class of formal languages. This allows several decidability and complexity results to be transferred, mainly from the area of formal languages to the areas of modal logics and formal language constrained reachability.
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملLogics and Algorithms for Verification of Concurrent Systems
Somla, R. 2012. Logics and Algorithms for Verification of Concurrent Systems. Uppsala University. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 964. 48 pp. Uppsala. ISBN 978-91-554-8447-7. In this thesis we investigate how the known framework of automatic formal verification by model checking can be extended in different directions. One exte...
متن کاملMethods of Translation of Petri Nets to NuSMV Language
The paper deals with the problem of translation of reachability graphs for place-transition and coloured Petri nets into the NuSMV language. The translation algorithms presented in the paper have been implemented as a part of the PetriNet2NuSMV tool so the translation is made automatically. The PetriNet2NuSMV tool works with reachability graphs generated by the TINA and CPN Tools software. Thus...
متن کاملThe model checking problem for propositional intuitionistic logic with one variable is AC^1-complete
We investigate the complexity of the model checking problem for propositional intuitionistic logic. We show that the model checking problem for intuitionistic logic with one variable is complete for logspace-uniform AC1, and for intuitionistic logic with two variables it is P-complete. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem an...
متن کاملExploiting Syntactic Structure for
Introduction Model Checking Techniques Hardware Veri cation Software Veri cation Overview of this work Model Checking for Temporal Logics Models of Systems Speci cations Model Checking Exploiting Structure in Software Veri cation The Structure of Programs Non deterministic While Programs Control Flow Graphs Semantics of Programs Modular Model Checking Partition Graphs Operations on Assumption F...
متن کامل